________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 20:41:02
Input Data from:  dataset140.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :100
# of Locations  :20
Ex.Facilities   :2
Total budget    :25000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,1765
Average f[i]   :4700
Average g[i,j] :2033,33333333333
Total demand   :5900
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 19
> Selected Move:	1420	1	-1	2	5000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1420


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 69
> Selected Move:	1630	1	-1	3	10000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1630


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 71
> Selected Move:	1930	1	-1	5	15000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1930


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 84
> Selected Move:	2600	1	-1	8	19000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 2600


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 34
> Selected Move:	3290	3	1	12	21000


> New Y[]: 
	
	 2  0  1  1  0  1  0  0  1  0  0  0  3  0  0  0  0  0  0  0    >new incumb.: 3290


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 41
> Selected Move:	3660	1	-1	16	25500


> New Y[]: 
	
	 2  0  1  1  0  1  0  0  1  0  0  0  3  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 50
> Selected Move:	3840	3	2	17	25000


> New Y[]: 
	
	 2  0  0  1  0  1  0  0  1  0  0  0  3  0  0  0  1  1  0  0    >new incumb.: 3840


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 44
> Selected Move:	3970	3	3	7	25000


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  0  0  3  0  0  0  1  1  0  0    >new incumb.: 3970


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 73
> Selected Move:	3845	3	17	2	25500


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  1  0  0  0  3  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 58
> Selected Move:	3680	3	2	13	25000


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  0  0  3  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 79
> Selected Move:	3730	3	8	17	25500


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  0  0  0  3  1  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 71
> Selected Move:	3620	3	12	10	25400


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  0  3  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 41
> Selected Move:	3810	3	13	8	24900


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  3  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 45
> Selected Move:	3717	4	10	16	25200


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  1  0  0  0  0  0  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 14 #######################


> Neighbours evaluated; 48
> Selected Move:	3785	3	16	12	25500


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  1  0  3  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 15 #######################


> Neighbours evaluated; 55
> Selected Move:	3610	3	10	13	25000


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  0  0  3  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 16 #######################


> Neighbours evaluated; 89
> Selected Move:	3530	2	13	-1	20500


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  0  0  3  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 17 #######################


> Neighbours evaluated; 73
> Selected Move:	3600	3	17	16	20500


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  0  0  3  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 18 #######################


> Neighbours evaluated; 65
> Selected Move:	3600	4	12	5	21900


> New Y[]: 
	
	 2  0  0  0  0  3  0  1  1  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 19 #######################


> Neighbours evaluated; 64
> Selected Move:	3600	4	5	7	22000


> New Y[]: 
	
	 2  0  0  0  0  1  0  3  1  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 20 #######################


> Neighbours evaluated; 63
> Selected Move:	3600	4	7	8	22400


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  3  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 21 #######################


> Neighbours evaluated; 60
> Selected Move:	3600	4	8	16	21700


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  0  0  1  0  0  0  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 22 #######################


> Neighbours evaluated; 66
> Selected Move:	3600	3	7	2	21700


> New Y[]: 
	
	 2  0  1  0  0  1  0  0  1  0  0  0  1  0  0  0  3  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 23 #######################


> Neighbours evaluated; 67
> Selected Move:	3600	4	16	2	21600


> New Y[]: 
	
	 2  0  3  0  0  1  0  0  1  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 24 #######################


> Neighbours evaluated; 67
> Selected Move:	3600	4	2	5	21900


> New Y[]: 
	
	 2  0  1  0  0  3  0  0  1  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 25 #######################


> Neighbours evaluated; 65
> Selected Move:	3600	4	5	8	22400


> New Y[]: 
	
	 2  0  1  0  0  1  0  0  3  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 26 #######################


> Neighbours evaluated; 62
> Selected Move:	3600	4	8	12	20500


> New Y[]: 
	
	 2  0  1  0  0  1  0  0  1  0  0  0  3  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 27 #######################


> Neighbours evaluated; 68
> Selected Move:	3680	1	-1	13	25000


> New Y[]: 
	
	 2  0  1  0  0  1  0  0  1  0  0  0  3  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 28 #######################


> Neighbours evaluated; 87
> Selected Move:	3650	3	8	7	26000


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  0  0  0  0  3  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 29 #######################


> Neighbours evaluated; 67
> Selected Move:	3600	2	2	-1	21000


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  0  0  0  3  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 30 #######################


> Neighbours evaluated; 63
> Selected Move:	3600	4	12	5	22400


> New Y[]: 
	
	 2  0  0  0  0  3  0  1  0  0  0  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 31 #######################


> Neighbours evaluated; 60
> Selected Move:	3600	4	5	7	22500


> New Y[]: 
	
	 2  0  0  0  0  1  0  3  0  0  0  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 32 #######################


> Neighbours evaluated; 60
> Selected Move:	3600	4	7	13	22900


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  0  0  0  1  3  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 33 #######################


> Neighbours evaluated; 55
> Selected Move:	3600	4	13	16	22200


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  0  0  0  1  1  0  0  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 34 #######################


> Neighbours evaluated; 59
> Selected Move:	3600	3	7	2	22200


> New Y[]: 
	
	 2  0  1  0  0  1  0  0  0  0  0  0  1  1  0  0  3  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 35 #######################


> Neighbours evaluated; 69
> Selected Move:	3600	4	16	2	22100


> New Y[]: 
	
	 2  0  3  0  0  1  0  0  0  0  0  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 36 #######################


> Neighbours evaluated; 70
> Selected Move:	3600	4	2	5	22400


> New Y[]: 
	
	 2  0  1  0  0  3  0  0  0  0  0  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 37 #######################


> Neighbours evaluated; 65
> Selected Move:	3600	4	5	12	21000


> New Y[]: 
	
	 2  0  1  0  0  1  0  0  0  0  0  0  3  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 38 #######################


> Neighbours evaluated; 67
> Selected Move:	3600	4	12	13	22900


> New Y[]: 
	
	 2  0  1  0  0  1  0  0  0  0  0  0  1  3  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 39 #######################


> Neighbours evaluated; 64
> Selected Move:	3540	3	2	9	23900


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  1  0  0  1  3  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,38

## ITERATION 40 #######################


> Neighbours evaluated; 50
> Selected Move:	3600	3	13	8	23400


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  3  1  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 41 #######################


> Neighbours evaluated; 63
> Selected Move:	3600	4	8	5	22900


> New Y[]: 
	
	 2  0  0  0  0  3  0  0  1  1  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 42 #######################


> Neighbours evaluated; 65
> Selected Move:	3600	4	5	9	21400


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  1  3  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 43 #######################


> Neighbours evaluated; 67
> Selected Move:	3600	4	9	12	21500


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  1  1  0  0  3  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 44 #######################


> Neighbours evaluated; 66
> Selected Move:	3600	4	12	16	22700


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  1  1  0  0  1  0  0  0  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 45 #######################


> Neighbours evaluated; 70
> Selected Move:	3540	3	8	13	23200


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  1  0  0  1  1  0  0  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,35

## ITERATION 46 #######################


> Neighbours evaluated; 54
> Selected Move:	3540	4	16	5	23400


> New Y[]: 
	
	 2  0  0  0  0  3  0  0  0  1  0  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,345

## ITERATION 47 #######################


> Neighbours evaluated; 53
> Selected Move:	3540	4	5	9	21900


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  3  0  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,34

## ITERATION 48 #######################


> Neighbours evaluated; 61
> Selected Move:	3540	4	9	12	22000


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  1  0  0  3  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,335

## ITERATION 49 #######################


> Neighbours evaluated; 70
> Selected Move:	3400	3	5	15	23000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  0  3  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 50 #######################


> Neighbours evaluated; 96
> Selected Move:	3400	4	12	9	22900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  3  0  0  1  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 51 #######################


> Neighbours evaluated; 96
> Selected Move:	3400	4	9	13	24900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  0  1  3  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 52 #######################


> Neighbours evaluated; 80
> Selected Move:	3400	4	13	15	23000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  0  1  1  0  3  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 53 #######################


> Neighbours evaluated; 94
> Selected Move:	3400	4	15	16	24200


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  0  1  1  0  1  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 54 #######################


> Neighbours evaluated; 92
> Selected Move:	3400	3	9	2	23200


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  0  0  0  1  1  0  1  3  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 55 #######################


> Neighbours evaluated; 99
> Selected Move:	3450	3	13	7	23700


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  0  0  0  0  1  0  0  1  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,3

## ITERATION 56 #######################


> Neighbours evaluated; 79
> Selected Move:	3470	3	15	5	22700


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  0  0  0  0  1  0  0  0  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,295

## ITERATION 57 #######################


> Neighbours evaluated; 39
> Selected Move:	3589	1	-1	8	26700


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  1  0  0  0  1  0  0  0  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 58 #######################


> Neighbours evaluated; 61
> Selected Move:	3647	3	12	10	25700


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  1  0  1  0  0  0  0  0  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 59 #######################


> Neighbours evaluated; 56
> Selected Move:	3736	4	16	10	25400


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  1  0  3  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 60 #######################


> Neighbours evaluated; 63
> Selected Move:	3682	4	10	2	25600


> New Y[]: 
	
	 2  0  3  0  0  1  0  1  1  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 61 #######################


> Neighbours evaluated; 43
> Selected Move:	3890	3	2	1	23500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,27

## ITERATION 62 #######################


> Neighbours evaluated; 79
> Selected Move:	4030	3	10	12	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  1  0  0  0  1  0  0  0    >new incumb.: 4030


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 63 #######################


> Neighbours evaluated; 74
> Selected Move:	4030	3	5	14	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 64 #######################


> Neighbours evaluated; 115
> Selected Move:	3900	3	8	13	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  0  1  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 65 #######################


> Neighbours evaluated; 106
> Selected Move:	4030	3	14	5	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 66 #######################


> Neighbours evaluated; 78
> Selected Move:	3890	3	12	10	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,275

## ITERATION 67 #######################


> Neighbours evaluated; 59
> Selected Move:	3870	3	5	15	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,27

## ITERATION 68 #######################


> Neighbours evaluated; 81
> Selected Move:	3870	3	13	8	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  1  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,265

## ITERATION 69 #######################


> Neighbours evaluated; 94
> Selected Move:	3878	3	10	12	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 70 #######################


> Neighbours evaluated; 113
> Selected Move:	3750	3	8	13	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  0  1  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 71 #######################


> Neighbours evaluated; 105
> Selected Move:	3620	3	15	10	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 72 #######################


> Neighbours evaluated; 94
> Selected Move:	3810	3	12	14	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 73 #######################


> Neighbours evaluated; 98
> Selected Move:	3810	3	13	8	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  1  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 74 #######################


> Neighbours evaluated; 110
> Selected Move:	3650	3	16	12	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  1  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 75 #######################


> Neighbours evaluated; 107
> Selected Move:	3890	3	14	5	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 76 #######################


> Neighbours evaluated; 77
> Selected Move:	3775	3	8	13	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  1  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 77 #######################


> Neighbours evaluated; 67
> Selected Move:	3760	3	7	16	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 78 #######################


> Neighbours evaluated; 79
> Selected Move:	3850	3	10	3	25000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  0  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 79 #######################


> Neighbours evaluated; 86
> Selected Move:	3850	3	13	8	24500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 80 #######################


> Neighbours evaluated; 77
> Selected Move:	3850	3	5	14	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  0  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 81 #######################


> Neighbours evaluated; 116
> Selected Move:	3748	3	8	13	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  1  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 82 #######################


> Neighbours evaluated; 117
> Selected Move:	3630	3	14	15	26000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  1  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 83 #######################


> Neighbours evaluated; 115
> Selected Move:	3733	3	13	8	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 84 #######################


> Neighbours evaluated; 114
> Selected Move:	3650	3	3	17	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 85 #######################


> Neighbours evaluated; 115
> Selected Move:	3620	3	15	5	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 86 #######################


> Neighbours evaluated; 117
> Selected Move:	3760	3	17	10	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 87 #######################


> Neighbours evaluated; 100
> Selected Move:	3710	3	12	3	23500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,18

## ITERATION 88 #######################


> Neighbours evaluated; 89
> Selected Move:	3710	3	8	13	24000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,175

## ITERATION 89 #######################


> Neighbours evaluated; 75
> Selected Move:	3623	3	16	12	25500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  1  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 90 #######################


> Neighbours evaluated; 69
> Selected Move:	3710	3	13	8	25000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 91 #######################


> Neighbours evaluated; 85
> Selected Move:	3630	3	3	6	25000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 92 #######################


> Neighbours evaluated; 87
> Selected Move:	3700	3	10	16	24500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 93 #######################


> Neighbours evaluated; 87
> Selected Move:	3703	3	8	7	25500


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 94 #######################


> Neighbours evaluated; 76
> Selected Move:	3705	3	6	19	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  0  1  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 95 #######################


> Neighbours evaluated; 96
> Selected Move:	3690	3	7	13	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  0  1  1  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 96 #######################


> Neighbours evaluated; 116
> Selected Move:	3680	3	19	8	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 97 #######################


> Neighbours evaluated; 111
> Selected Move:	3690	3	16	7	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 98 #######################


> Neighbours evaluated; 98
> Selected Move:	3690	3	13	6	25000


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 99 #######################


> Neighbours evaluated; 81
> Selected Move:	3725	3	5	15	26000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 100 #######################


> Neighbours evaluated; 92
> Selected Move:	3710	3	6	10	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 101 #######################


> Neighbours evaluated; 109
> Selected Move:	3638	1	-1	16	30500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  1  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 102 #######################


> Neighbours evaluated; 117
> Selected Move:	3750	3	15	5	29500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 103 #######################


> Neighbours evaluated; 94
> Selected Move:	3710	3	10	13	29000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 104 #######################


> Neighbours evaluated; 117
> Selected Move:	3640	3	8	10	30000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  1  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 105 #######################


> Neighbours evaluated; 86
> Selected Move:	3625	4	1	12	26000


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  0  1  0  3  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 106 #######################


> Neighbours evaluated; 78
> Selected Move:	3800	3	16	17	26000


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  0  1  0  3  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 107 #######################


> Neighbours evaluated; 75
> Selected Move:	3709	3	12	16	25700


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  0  1  0  0  1  0  0  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 108 #######################


> Neighbours evaluated; 67
> Selected Move:	3715	3	10	12	26700


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  0  0  0  1  1  0  0  3  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 109 #######################


> Neighbours evaluated; 85
> Selected Move:	3784	3	13	8	26200


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  0  0  1  0  0  0  3  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 110 #######################


> Neighbours evaluated; 85
> Selected Move:	3796	3	16	10	26400


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  3  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 111 #######################


> Neighbours evaluated; 67
> Selected Move:	3707	4	10	5	26900


> New Y[]: 
	
	 2  0  0  0  0  3  0  1  1  0  1  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 112 #######################


> Neighbours evaluated; 52
> Selected Move:	3742	3	12	16	25400


> New Y[]: 
	
	 2  0  0  0  0  3  0  1  1  0  1  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 113 #######################


> Neighbours evaluated; 64
> Selected Move:	3780	3	5	15	25000


> New Y[]: 
	
	 2  0  0  0  0  0  0  1  1  0  1  0  0  0  0  3  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 114 #######################


> Neighbours evaluated; 78
> Selected Move:	3760	3	17	2	25500


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  1  0  1  0  0  0  0  3  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,185

## ITERATION 115 #######################


> Neighbours evaluated; 89
> Selected Move:	3793	3	10	12	26500


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  1  0  0  0  1  0  0  3  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 116 #######################


> Neighbours evaluated; 101
> Selected Move:	3785	4	15	12	26500


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  1  0  0  0  3  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 117 #######################


> Neighbours evaluated; 102
> Selected Move:	3735	3	15	14	26000


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  1  0  0  0  3  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 118 #######################


> Neighbours evaluated; 103
> Selected Move:	3730	4	12	14	26000


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  1  0  0  0  1  0  3  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 119 #######################


> Neighbours evaluated; 102
> Selected Move:	3770	3	12	10	25000


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  1  0  1  0  0  0  3  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 120 #######################


> Neighbours evaluated; 92
> Selected Move:	3661	3	14	5	25900


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  1  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 121 #######################


> Neighbours evaluated; 60
> Selected Move:	3682	3	10	12	26900


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  1  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 122 #######################


> Neighbours evaluated; 64
> Selected Move:	3738	4	5	2	26600


> New Y[]: 
	
	 2  0  3  0  0  1  0  1  1  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 123 #######################


> Neighbours evaluated; 66
> Selected Move:	3753	3	2	18	26100


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  0  0  1  0  0  0  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 124 #######################


> Neighbours evaluated; 78
> Selected Move:	3797	3	12	10	25100


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  1  0  0  0  0  0  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,235

## ITERATION 125 #######################


> Neighbours evaluated; 80
> Selected Move:	3646	3	18	17	25700


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  1  0  0  0  0  0  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 126 #######################


> Neighbours evaluated; 49
> Selected Move:	3690	4	17	7	25500


> New Y[]: 
	
	 2  0  0  0  0  1  0  3  1  0  1  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 127 #######################


> Neighbours evaluated; 69
> Selected Move:	3605	3	17	2	26000


> New Y[]: 
	
	 2  0  1  0  0  1  0  3  1  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 128 #######################


> Neighbours evaluated; 60
> Selected Move:	3625	3	7	12	25500


> New Y[]: 
	
	 2  0  1  0  0  1  0  0  1  0  1  0  3  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 129 #######################


> Neighbours evaluated; 74
> Selected Move:	3705	3	16	7	26000


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  1  0  1  0  3  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 130 #######################


> Neighbours evaluated; 61
> Selected Move:	3630	3	2	16	25500


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  1  0  3  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 131 #######################


> Neighbours evaluated; 67
> Selected Move:	3678	3	10	6	25500


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  1  0  0  0  3  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 132 #######################


> Neighbours evaluated; 66
> Selected Move:	3655	3	6	4	26500


> New Y[]: 
	
	 2  0  0  0  1  1  0  1  1  0  0  0  3  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 133 #######################


> Neighbours evaluated; 63
> Selected Move:	3588	3	4	18	26500


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  0  0  3  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 134 #######################


> Neighbours evaluated; 73
> Selected Move:	3570	2	8	-1	22500


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  0  0  0  3  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 135 #######################


> Neighbours evaluated; 63
> Selected Move:	3570	4	12	5	23900


> New Y[]: 
	
	 2  0  0  0  0  3  0  1  0  0  0  0  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 136 #######################


> Neighbours evaluated; 57
> Selected Move:	3570	4	5	7	24000


> New Y[]: 
	
	 2  0  0  0  0  1  0  3  0  0  0  0  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 137 #######################


> Neighbours evaluated; 57
> Selected Move:	3570	4	7	16	23700


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 138 #######################


> Neighbours evaluated; 57
> Selected Move:	3570	4	16	18	22100


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 139 #######################


> Neighbours evaluated; 72
> Selected Move:	3500	3	18	4	23000


> New Y[]: 
	
	 2  0  0  0  3  1  0  1  0  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 140 #######################


> Neighbours evaluated; 66
> Selected Move:	3560	3	16	8	22500


> New Y[]: 
	
	 2  0  0  0  3  1  0  1  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 141 #######################


> Neighbours evaluated; 63
> Selected Move:	3560	4	4	5	23400


> New Y[]: 
	
	 2  0  0  0  1  3  0  1  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 142 #######################


> Neighbours evaluated; 54
> Selected Move:	3560	4	5	7	23500


> New Y[]: 
	
	 2  0  0  0  1  1  0  3  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 143 #######################


> Neighbours evaluated; 53
> Selected Move:	3560	4	7	8	23900


> New Y[]: 
	
	 2  0  0  0  1  1  0  1  3  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 144 #######################


> Neighbours evaluated; 56
> Selected Move:	3560	4	8	12	22000


> New Y[]: 
	
	 2  0  0  0  1  1  0  1  1  0  0  0  3  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 145 #######################


> Neighbours evaluated; 76
> Selected Move:	3500	3	5	15	23000


> New Y[]: 
	
	 2  0  0  0  1  0  0  1  1  0  0  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 146 #######################


> Neighbours evaluated; 80
> Selected Move:	3500	4	12	4	23500


> New Y[]: 
	
	 2  0  0  0  3  0  0  1  1  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 147 #######################


> Neighbours evaluated; 77
> Selected Move:	3500	4	4	7	24500


> New Y[]: 
	
	 2  0  0  0  1  0  0  3  1  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 148 #######################


> Neighbours evaluated; 68
> Selected Move:	3500	4	7	8	24900


> New Y[]: 
	
	 2  0  0  0  1  0  0  1  3  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 149 #######################


> Neighbours evaluated; 66
> Selected Move:	3500	4	8	15	23000


> New Y[]: 
	
	 2  0  0  0  1  0  0  1  1  0  0  0  1  0  0  3  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 150 #######################


> Neighbours evaluated; 90
> Selected Move:	3450	3	4	2	22000


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  1  0  0  0  1  0  0  3  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 151 #######################


> Neighbours evaluated; 87
> Selected Move:	3470	3	15	5	22400


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 152 #######################


> Neighbours evaluated; 47
> Selected Move:	3530	3	2	17	21900


> New Y[]: 
	
	 2  0  0  0  0  3  0  1  1  0  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 153 #######################


> Neighbours evaluated; 75
> Selected Move:	3641	1	-1	16	26400


> New Y[]: 
	
	 2  0  0  0  0  3  0  1  1  0  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 154 #######################


> Neighbours evaluated; 68
> Selected Move:	3705	3	5	14	25500


> New Y[]: 
	
	 2  0  0  0  0  0  0  1  1  0  0  0  1  0  3  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 155 #######################


> Neighbours evaluated; 83
> Selected Move:	3708	4	14	12	25500


> New Y[]: 
	
	 2  0  0  0  0  0  0  1  1  0  0  0  3  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 156 #######################


> Neighbours evaluated; 97
> Selected Move:	3630	3	14	15	26000


> New Y[]: 
	
	 2  0  0  0  0  0  0  1  1  0  0  0  3  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 157 #######################


> Neighbours evaluated; 88
> Selected Move:	3635	4	12	15	26000


> New Y[]: 
	
	 2  0  0  0  0  0  0  1  1  0  0  0  1  0  0  3  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 158 #######################


> Neighbours evaluated; 90
> Selected Move:	3620	3	7	3	26000


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  0  0  0  1  0  0  3  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,225

## ITERATION 159 #######################


> Neighbours evaluated; 76
> Selected Move:	3615	4	15	12	26000


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  0  0  0  3  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,23

## ITERATION 160 #######################


> Neighbours evaluated; 77
> Selected Move:	3545	3	17	2	26500


> New Y[]: 
	
	 2  0  1  1  0  0  0  0  1  0  0  0  3  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 161 #######################


> Neighbours evaluated; 97
> Selected Move:	3538	4	12	15	26500


> New Y[]: 
	
	 2  0  1  1  0  0  0  0  1  0  0  0  1  0  0  3  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 162 #######################


> Neighbours evaluated; 97
> Selected Move:	3520	3	12	10	25500


> New Y[]: 
	
	 2  0  1  1  0  0  0  0  1  0  1  0  0  0  0  3  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,245

## ITERATION 163 #######################


> Neighbours evaluated; 76
> Selected Move:	3590	3	15	14	25000


> New Y[]: 
	
	 2  0  1  1  0  0  0  0  1  0  1  0  0  0  3  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 164 #######################


> Neighbours evaluated; 81
> Selected Move:	3510	3	2	17	24500


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  0  1  0  0  0  3  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 165 #######################


> Neighbours evaluated; 54
> Selected Move:	3530	3	14	15	25000


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  0  1  0  0  0  0  3  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,26

## ITERATION 166 #######################


> Neighbours evaluated; 61
> Selected Move:	3426	3	15	5	25400


> New Y[]: 
	
	 2  0  0  1  0  3  0  0  1  0  1  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 167 #######################


> Neighbours evaluated; 43
> Selected Move:	3530	4	5	3	24800


> New Y[]: 
	
	 2  0  0  3  0  1  0  0  1  0  1  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 168 #######################


> Neighbours evaluated; 51
> Selected Move:	3624	3	10	12	25800


> New Y[]: 
	
	 2  0  0  3  0  1  0  0  1  0  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 169 #######################


> Neighbours evaluated; 64
> Selected Move:	3558	3	3	7	26500


> New Y[]: 
	
	 2  0  0  0  0  1  0  3  1  0  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 170 #######################


> Neighbours evaluated; 68
> Selected Move:	3548	3	7	9	25900


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  1  3  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 171 #######################


> Neighbours evaluated; 74
> Selected Move:	3561	3	17	7	26400


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  3  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,29

## ITERATION 172 #######################


> Neighbours evaluated; 49
> Selected Move:	3525	4	9	12	26500


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  1  0  0  3  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,295

## ITERATION 173 #######################


> Neighbours evaluated; 45
> Selected Move:	3553	3	9	3	25500


> New Y[]: 
	
	 2  0  0  1  0  1  0  1  1  0  0  0  3  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,3

## ITERATION 174 #######################


> Neighbours evaluated; 44
> Selected Move:	3460	3	3	19	25500


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  0  0  3  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 175 #######################


> Neighbours evaluated; 89
> Selected Move:	3470	3	12	1	23500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 176 #######################


> Neighbours evaluated; 89
> Selected Move:	3660	3	16	12	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 177 #######################


> Neighbours evaluated; 90
> Selected Move:	3610	3	7	16	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  0  1  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 178 #######################


> Neighbours evaluated; 102
> Selected Move:	3610	3	19	2	24500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 179 #######################


> Neighbours evaluated; 66
> Selected Move:	3610	3	8	13	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 180 #######################


> Neighbours evaluated; 72
> Selected Move:	3620	3	2	6	25000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  0  0  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 181 #######################


> Neighbours evaluated; 83
> Selected Move:	3620	3	6	17	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  0  1  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 182 #######################


> Neighbours evaluated; 102
> Selected Move:	3570	3	13	7	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 183 #######################


> Neighbours evaluated; 81
> Selected Move:	3610	3	16	8	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 184 #######################


> Neighbours evaluated; 79
> Selected Move:	3590	3	7	10	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  1  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 185 #######################


> Neighbours evaluated; 96
> Selected Move:	3510	3	8	13	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  0  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 186 #######################


> Neighbours evaluated; 90
> Selected Move:	3530	3	10	7	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  0  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 187 #######################


> Neighbours evaluated; 88
> Selected Move:	3593	3	17	19	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  0  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 188 #######################


> Neighbours evaluated; 86
> Selected Move:	3550	3	5	16	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  0  1  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 189 #######################


> Neighbours evaluated; 113
> Selected Move:	3550	3	12	5	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 190 #######################


> Neighbours evaluated; 81
> Selected Move:	3600	3	13	10	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  1  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 191 #######################


> Neighbours evaluated; 71
> Selected Move:	3600	3	19	6	24500


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 192 #######################


> Neighbours evaluated; 81
> Selected Move:	3570	3	5	14	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  1  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,265

## ITERATION 193 #######################


> Neighbours evaluated; 96
> Selected Move:	3540	3	10	8	24000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  0  0  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,26

## ITERATION 194 #######################


> Neighbours evaluated; 95
> Selected Move:	3580	3	7	12	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  0  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 195 #######################


> Neighbours evaluated; 110
> Selected Move:	3550	3	6	2	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  0  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 196 #######################


> Neighbours evaluated; 108
> Selected Move:	3520	3	2	5	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  0  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 197 #######################


> Neighbours evaluated; 102
> Selected Move:	3628	3	14	9	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  1  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 198 #######################


> Neighbours evaluated; 73
> Selected Move:	3630	3	9	11	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  1  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 199 #######################


> Neighbours evaluated; 74
> Selected Move:	3583	3	11	18	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  0  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 200 #######################


> Neighbours evaluated; 104
> Selected Move:	3540	3	12	7	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 201 #######################


> Neighbours evaluated; 82
> Selected Move:	3560	3	18	11	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 202 #######################


> Neighbours evaluated; 86
> Selected Move:	3560	3	5	14	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  1  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,215

## ITERATION 203 #######################


> Neighbours evaluated; 90
> Selected Move:	3540	3	11	18	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,21

## ITERATION 204 #######################


> Neighbours evaluated; 95
> Selected Move:	3510	3	14	10	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  1  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,205

## ITERATION 205 #######################


> Neighbours evaluated; 111
> Selected Move:	3620	3	18	12	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 206 #######################


> Neighbours evaluated; 103
> Selected Move:	3540	3	10	6	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 207 #######################


> Neighbours evaluated; 95
> Selected Move:	3558	3	8	15	26500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,19

## ITERATION 208 #######################


> Neighbours evaluated; 96
> Selected Move:	3565	3	6	19	26500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  0  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 209 #######################


> Neighbours evaluated; 98
> Selected Move:	3495	3	15	14	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  0  1  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 210 #######################


> Neighbours evaluated; 109
> Selected Move:	3520	3	12	10	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 211 #######################


> Neighbours evaluated; 96
> Selected Move:	3530	3	14	13	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 212 #######################


> Neighbours evaluated; 109
> Selected Move:	3510	3	19	8	23000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,165

## ITERATION 213 #######################


> Neighbours evaluated; 104
> Selected Move:	3540	3	10	5	23000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 214 #######################


> Neighbours evaluated; 97
> Selected Move:	3550	1	-1	10	28000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 215 #######################


> Neighbours evaluated; 97
> Selected Move:	3495	4	0	5	25100


> New Y[]: 
	
	 0  3  0  0  0  2  0  1  1  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,16

## ITERATION 216 #######################


> Neighbours evaluated; 68
> Selected Move:	3500	3	5	15	24600


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  1  0  1  0  0  1  0  2  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,165

## ITERATION 217 #######################


> Neighbours evaluated; 41
> Selected Move:	3494	3	13	6	25100


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  1  0  1  0  0  0  0  2  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0 
 > pw :0,17

## ITERATION 218 #######################


> Neighbours evaluated; 40
> Selected Move:	3510	3	15	0	23500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,165

## ITERATION 219 #######################


> Neighbours evaluated; 103
> Selected Move:	3540	3	10	5	23500


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  1  0  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 220 #######################


> Neighbours evaluated; 88
> Selected Move:	3566	3	1	10	25400


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  1  0  3  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,155

## ITERATION 221 #######################


> Neighbours evaluated; 73
> Selected Move:	3603	3	6	18	26400


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  3  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,16

## ITERATION 222 #######################


> Neighbours evaluated; 71
> Selected Move:	3586	3	18	4	26400


> New Y[]: 
	
	 2  0  0  0  1  1  0  1  1  0  3  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 223 #######################


> Neighbours evaluated; 66
> Selected Move:	3645	4	10	4	26000


> New Y[]: 
	
	 2  0  0  0  3  1  0  1  1  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 224 #######################


> Neighbours evaluated; 73
> Selected Move:	3720	3	10	12	27000


> New Y[]: 
	
	 2  0  0  0  3  1  0  1  1  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 225 #######################


> Neighbours evaluated; 75
> Selected Move:	3673	3	4	17	26700


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  0  0  1  0  0  0  1  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 226 #######################


> Neighbours evaluated; 83
> Selected Move:	3628	4	17	8	26900


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  3  0  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 227 #######################


> Neighbours evaluated; 91
> Selected Move:	3646	3	17	2	27400


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  3  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 228 #######################


> Neighbours evaluated; 61
> Selected Move:	3710	4	8	7	27000


> New Y[]: 
	
	 2  0  1  0  0  1  0  3  1  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 229 #######################


> Neighbours evaluated; 68
> Selected Move:	3657	3	7	3	26300


> New Y[]: 
	
	 2  0  1  3  0  1  0  0  1  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 230 #######################


> Neighbours evaluated; 70
> Selected Move:	3610	3	12	10	25300


> New Y[]: 
	
	 2  0  1  3  0  1  0  0  1  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 231 #######################


> Neighbours evaluated; 63
> Selected Move:	3588	4	3	10	25400


> New Y[]: 
	
	 2  0  1  1  0  1  0  0  1  0  3  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 232 #######################


> Neighbours evaluated; 67
> Selected Move:	3544	4	10	2	25600


> New Y[]: 
	
	 2  0  3  1  0  1  0  0  1  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 233 #######################


> Neighbours evaluated; 65
> Selected Move:	3566	3	10	12	26600


> New Y[]: 
	
	 2  0  3  1  0  1  0  0  1  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 234 #######################


> Neighbours evaluated; 65
> Selected Move:	3548	3	2	18	26100


> New Y[]: 
	
	 2  0  0  1  0  1  0  0  1  0  0  0  1  0  0  0  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 235 #######################


> Neighbours evaluated; 77
> Selected Move:	3483	3	3	2	26100


> New Y[]: 
	
	 2  0  1  0  0  1  0  0  1  0  0  0  1  0  0  0  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 236 #######################


> Neighbours evaluated; 102
> Selected Move:	3448	3	18	9	26400


> New Y[]: 
	
	 2  0  1  0  0  1  0  0  1  3  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 237 #######################


> Neighbours evaluated; 73
> Selected Move:	3481	3	2	6	26400


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  1  3  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 238 #######################


> Neighbours evaluated; 58
> Selected Move:	3474	3	12	10	25400


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  1  3  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 239 #######################


> Neighbours evaluated; 57
> Selected Move:	3520	3	9	1	23500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 240 #######################


> Neighbours evaluated; 89
> Selected Move:	3610	3	6	9	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  1  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,255

## ITERATION 241 #######################


> Neighbours evaluated; 83
> Selected Move:	3610	3	8	13	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,26

## ITERATION 242 #######################


> Neighbours evaluated; 53
> Selected Move:	3490	3	10	12	26000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 243 #######################


> Neighbours evaluated; 68
> Selected Move:	3520	2	9	-1	20000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 244 #######################


> Neighbours evaluated; 71
> Selected Move:	3520	3	13	8	19500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 245 #######################


> Neighbours evaluated; 62
> Selected Move:	3483	1	-1	4	25500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 246 #######################


> Neighbours evaluated; 64
> Selected Move:	3460	3	12	7	24500


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  1  0  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 247 #######################


> Neighbours evaluated; 50
> Selected Move:	3460	3	4	2	23500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 248 #######################


> Neighbours evaluated; 52
> Selected Move:	3470	3	1	14	25000


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  1  0  0  0  0  0  3  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,265

## ITERATION 249 #######################


> Neighbours evaluated; 77
> Selected Move:	3414	3	14	18	25100


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  1  0  0  0  0  0  0  0  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 250 #######################


> Neighbours evaluated; 86
> Selected Move:	3424	3	7	10	25100


> New Y[]: 
	
	 2  0  1  0  0  1  0  0  1  0  1  0  0  0  0  0  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 251 #######################


> Neighbours evaluated; 83
> Selected Move:	3470	3	18	1	23500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 252 #######################


> Neighbours evaluated; 72
> Selected Move:	3520	3	2	18	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  1  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 253 #######################


> Neighbours evaluated; 91
> Selected Move:	3510	3	16	7	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 254 #######################


> Neighbours evaluated; 91
> Selected Move:	3510	3	18	6	24000


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  1  0  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 255 #######################


> Neighbours evaluated; 89
> Selected Move:	3510	3	5	12	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 256 #######################


> Neighbours evaluated; 92
> Selected Move:	3475	3	10	14	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 257 #######################


> Neighbours evaluated; 91
> Selected Move:	3590	3	6	13	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 258 #######################


> Neighbours evaluated; 115
> Selected Move:	3560	3	14	15	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 259 #######################


> Neighbours evaluated; 114
> Selected Move:	3540	3	15	16	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 260 #######################


> Neighbours evaluated; 103
> Selected Move:	3480	3	7	15	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 261 #######################


> Neighbours evaluated; 112
> Selected Move:	3548	3	8	17	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  1  1  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 262 #######################


> Neighbours evaluated; 110
> Selected Move:	3520	3	15	14	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  1  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,195
________________________________________________________________

Best solution found: 4030
Run Termination time: 03.02.2010 20:43:42
Run duration: 00:02:40.2656250
________________________________________________________________
